Decomposing finite Abelian groups

نویسندگان

  • Kevin K. H. Cheung
  • Michele Mosca
چکیده

This paper describes a quantum algorithm for efficiently decomposing finite Abelian groups. Such a decomposition is needed in order to apply the Abelian hidden subgroup algorithm. Such a decomposition (assuming the Generalized Riemann Hypothesis) also leads to an efficient algorithm for computing class numbers (known to be at least as difficult as factoring).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Quantum Algorithm for Decomposing Black-Box Finite Abelian Groups

Cheung and Mosca [1] gave an efficient quantum algorithm for decomposing finite abelian groups in a unique-encoding group model. We present another efficient quantum algorithm for this problem in a more general model, the black-box group model, where each group element is not necessarily uniquely encoded.

متن کامل

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

متن کامل

On non-normal non-abelian subgroups of finite groups

‎In this paper we prove that a finite group $G$ having at most three‎ ‎conjugacy classes of non-normal non-abelian proper subgroups is‎ ‎always solvable except for $Gcong{rm{A_5}}$‎, ‎which extends Theorem 3.3‎ ‎in [Some sufficient conditions on the number of‎ ‎non-abelian subgroups of a finite group to be solvable‎, ‎Acta Math‎. ‎Sinica (English Series) 27 (2011) 891--896.]‎. ‎Moreover‎, ‎we s...

متن کامل

Finite $p$-groups and centralizers of non-cyclic abelian subgroups

A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is ‎cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq‎ ‎Z(G)$‎. ‎In this paper‎, ‎we give a complete classification of‎ ‎finite $mathcal{CAC}$-$p$-groups‎.

متن کامل

THE STRUCTURE OF FINITE ABELIAN p-GROUPS BY THE ORDER OF THEIR SCHUR MULTIPLIERS

A well-known result of Green [4] shows for any finite p-group G of order p^n, there is an integer t(G) , say corank(G), such that |M(G)|=p^(1/2n(n-1)-t(G)) . Classifying all finite p-groups in terms of their corank, is still an open problem. In this paper we classify all finite abelian p-groups by their coranks.  

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Quantum Information & Computation

دوره 1  شماره 

صفحات  -

تاریخ انتشار 2001